PySCP: A Multiple-Phase Optimal Control Software Using Sequential Convex Programming
نویسندگان
چکیده
Optimal control problems are common in aerospace engineering. A Python software program called PySCP is described for solving multiple-phase optimal using sequential convex programming methods. By constructing a series of approximated second-order cone subproblems, approaches to the solution original problem an iterative way. The key components detail, including convexification, discretization, and adaptive trust region method. convexification first-order differential dynamic equation implemented successive linearization. Six discretization methods, zero-order hold, Runge-Kutta, three hp pseudospectral collocation so that different types can be tackled efficiently. Adaptive method employed, robust convergence achieved. Both free-final-time fixed-final-time solved by software. application demonstrated on with varying complexity. provides researchers useful toolkit solve wide variety programming.
منابع مشابه
Real-Time Sequential Convex Programming for Optimal Control Applications
This paper proposes real-time sequential convex programming (RTSCP), a method for solving a sequence of nonlinear optimization problems depending on an online parameter. We provide a contraction estimate for the proposed method and, as a byproduct, a new proof of the local convergence of sequential convex programming. The approach is illustrated by an example where RTSCP is applied to nonlinear...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملa numerical approach for optimal control model of the convex semi-infinite programming
in this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. in final, numerical examples are provided for illustration of the purposed method.
متن کاملRobust control of quantum gates via sequential convex programming
Resource tradeoffs can often be established by solving an appropriate robust optimization problem for a variety of scenarios involving constraints on optimization variables and uncertainties. Using an approach based on sequential convex programming, we demonstrate that quantum gate transformations can be made substantially robust against uncertainties while simultaneously using limited resource...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Aerospace Engineering
سال: 2022
ISSN: ['1687-5966', '1687-5974']
DOI: https://doi.org/10.1155/2022/2969809